A Formal Study of Boolean Games with Random Formulas as Pay Functions

نویسندگان

  • Erik Martin-Dorel
  • Sergei Soloviev
چکیده

In this paper, we present a probabilistic analysis of Boolean games. We consider the class of Boolean games where pay functions are given by random Boolean formulas. This permits to study certain properties of this class in its totality, such as the probability of existence of a winning strategy, including its asymptotic behaviour. With the help of the Coq proof assistant, we develop a Coq library of Boolean games, to provide a formal proof of our results, and a basis for further developments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Relationship Between Tendency to Computer Games and the Mental Health of Junior High School Students of Shahr-e Kord, Iran

Background and aims: Given that computer games have positive and negative functions and mayaffect the mental health of individuals, the present research aimed to study the relationship betweenthe tendency to playing computer games and the mental health of junior high school students inShahr-e Kord.Methods: The current cross-sectional descriptive-analytical study was cond...

متن کامل

Weighted Boolean Formula Games

We introduce a new class of succinct games, called weighted boolean formula games. Here,each player has a set of boolean formulas he wants to get satisfied. The boolean formulas ofall players involve a ground set of boolean variables, and every player controls some of thesevariables. The payoff of a player is the weighted sum of the values of his boolean formulas. For theseg...

متن کامل

Boolean Games with Norms

In the present paper we overlay boolean game with norms. Norms distinguish illegal strategies from legal strategies. Two types of legal strategy and legal Nash equilibrium are defined. These two equilibrium are viewed as solution concepts for law abiding agents in norm augmented boolean games. Our formal model is a combination of boolean games and so called input/output logic. We study various ...

متن کامل

Random fields of bounded variation and computation of their variation intensity

The main purpose of this paper is to define and characterize random fields of bounded variation, that is random fields with sample paths in the space of functions of bounded variation, and to study their mean total variation. Simple formulas are obtained for the mean total directional variation of random fields, based on known formulas for the directional variation of deterministic functions. I...

متن کامل

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017